package lyl.sort;

public class Main {

    public static void main(String[] args) {
        SortEx sortEx = new SortEx();
        QuickEx quickEx = new QuickEx();
        MergeSort mergeSort = new MergeSort();
        int arr[] = new int[10];
        for (int i = 0; i < arr.length; i++) {
            arr[i] = (int)(Math.random()*100);
        }
        for (int i = 0; i < arr.length; i++) {
            System.out.print(arr[i] );
            if (i < arr.length-1){
                System.out.print(",");
            }
        }
        System.out.println();
       // quickEx.quickSort(arr,0,arr.length - 1);
        mergeSort.mergeSort(arr);
        for (int i = 0; i < arr.length; i++) {
            System.out.print(arr[i] );
            if (i < arr.length - 1){
                System.out.print(",");
            }
        }
        System.out.println();
    }
}
